Computing minimal interpolants in $C^{1, 1}(\mathbb{R}^d)$
نویسندگان
چکیده
We consider the following interpolation problem. Suppose one is given a finite set E ⊂ R, a function f : E → R, and possibly the gradients of f at the points of E. We want to interpolate the given information with a function F ∈ C(R) with the minimum possible value of Lip(∇F ). We present practical, efficient algorithms for constructing an F such that Lip(∇F ) is minimal, or for less computational effort, within a small dimensionless constant of being minimal.
منابع مشابه
New methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملLow coherence unit norm tight frames
Equiangular tight frames (ETFs) have found significant applications in signal processing and coding theory due to their robustness to noise and transmission losses. ETFs are characterized by the fact that the coherence between any two distinct vectors is equal to the Welch bound. This guarantees that the maximum coherence between pairs of vectors is minimized. Despite their usefulness and wides...
متن کاملCoercive functions from a topological viewpoint and properties of minimizing sets of convex functions appearing in image restoration
Many tasks in image processing can be tackled by modeling an appropriate data fidelity term $\Phi: \mathbb{R}^n \rightarrow \mathbb{R} \cup \{+\infty\}$ and then solve one of the regularized minimization problems \begin{align*}&{}(P_{1,\tau}) \qquad \mathop{\rm argmin}_{x \in \mathbb R^n} \big\{ \Phi(x) \;{\rm s.t.}\; \Psi(x) \leq \tau \big\} \\&{}(P_{2,\lambda}) \qquad \mathop{\rm argmin}_{x \...
متن کاملPositive-additive functional equations in non-Archimedean $C^*$-algebras
Hensel [K. Hensel, Deutsch. Math. Verein, {6} (1897), 83-88.] discovered the $p$-adic number as a number theoretical analogue of power series in complex analysis. Fix a prime number $p$. for any nonzero rational number $x$, there exists a unique integer $n_x inmathbb{Z}$ such that $x = frac{a}{b}p^{n_x}$, where $a$ and $b$ are integers not divisible by $p$. Then $|x...
متن کاملComputing minimal interpolants in C(R)
We consider the following interpolation problem. Suppose one is given a finite set E ⊂ R, a function f : E → R, and possibly the gradients of f at the points of E as well. We want to interpolate the given information with a function F ∈ C(R) with the minimum possible value of Lip(∇F ). We present practical, efficient algorithms for constructing an F such that Lip(∇F ) is minimal, or for less co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1411.5668 شماره
صفحات -
تاریخ انتشار 2014